Complete permutation Gray code implemented by finite state machine

Finite-State Code Generation

This paper describes GBURG, which generates tiny, fast code generators based on finite-state machine pattern matching. The code generators translate postfix intermediate code into machine instructions in one pass (except, of course, for backpatching addresses). A stack-based virtual machine-known as the Lean Virtual Machine (LVM)-tuned for fast code generation is also described. GBURG translate...

State Assignment for Finite State Machine Synthesis

This paper proposes simulated annealing based algorithm for the synthesis of a finite state machine to determine the optimal state assignment with less area and power dissipation. The algorithm has two annealing stages. In the first rough annealing stage it tries to search in global scope by the proposed rough search method. In the second focusing annealing stage it tries to search in local sco...

Finite state machine for mutation

In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety of finite state machines. The mutation is studied systematically and an automaton have been constructed with the b...

Translatable Finite State Time Machine

The paper describes syntax, behavior and formal semantics of a new class of timed automata, which are tailored for modeling the behavior of real-time systems. A formal method for automatic generation of programs is developed around this model. The method starts from modeling the desired behavior of the system under design by means of a UML-based state machine with the ability to measure time, a...

Finite State Machine Based SDL